Mobile transport for extracting and depositing energy

ABSTRACT

An example operation includes one or more of maneuvering, by a Mobile Energy Storage Unit (MESU), to a transport that is stationary for an amount of time, that is not currently being charged, that is at a distance between the transport and the MESU and that is within a timeframe for the MESU to reach the transport, and retrieving, by MESU, a minimum amount of energy from the transport.

CROSS-REFERENCE TO RELATED APPLICATIONS

Cross-reference is made to the following commonly assigned U.S. patentapplications being filed on the same date herewith: U.S. non-provisionalpatent application Ser. No. 16/821,905 entitled, “WIRELESSLY NOTIFYING ATRANSPORT TO PROVIDE A PORTION OF ENERGY”; U.S. non-provisional patentapplication Ser. No. 16/821,923 entitled, “DISTANCE-BASED ENERGYTRANSFER FROM A TRANSPORT”; U.S. non-provisional patent application Ser.No. 16/821,961 entitled, “EXECUTING AN ENERGY TRANSFER DIRECTIVE FOR ANIDLE TRANSPORT”; and U.S. non-provisional patent application Ser. No.16/821,974 entitled, “TRANSPORT-BASED ENERGY ALLOCATION,” each of whichis incorporated by reference herein in its entirety for all purposes.

TECHNICAL FIELD

This application generally relates to a transport providing charge to anelectric grid, and more particularly, to a mobile transport forextracting and depositing energy.

BACKGROUND

There may be occurrences where an electric grid, further referred to as“grid”, requires excess energy. The reason many residential blackoutsoccur during summer is an increased use of energy. The extra power usedto keep buildings cool may overwhelm the system in a given area andcause the power failures. This may be during times of high temperature,or any other condition when the managers of the electric are facing theneed to perform blackouts to manage an amount of needed flow ofelectricity. What is needed is to provide a way to collect a surplus ofenergy from electric vehicles during a time of need.

SUMMARY

One example embodiment provides a method that includes one or more ofmaneuvering, by a Mobile Energy Storage Unit (MESU), to a transport thatis stationary for an amount of time, that is not currently beingcharged, that is at a distance between the transport and the MESU andthat is within a timeframe for the MESU to reach the transport, andretrieving, by the mobile energy storage unit, a minimum amount ofenergy from the transport.

Another example embodiment provides a MESU comprising a processorconfigured to perform one or more of maneuver to a transport that isstationary for an amount of time, that is not currently in a state ofcharge, that is at a distance between the transport and the MESU andthat is within a timeframe for the MESU to reach the transport, andretrieve a minimum amount of energy from the transport.

A further example embodiment provides a non-transitory computer readablemedium comprising instructions, that when read by a processor, cause theprocessor to perform one or more of maneuvering, by a Mobile EnergyStorage Unit (MESU), to a transport that is stationary for an amount oftime, that is not currently being charged, that is at a distance betweenthe transport and the MESU and that is within a timeframe for the MESUto reach the transport, and retrieving, by the mobile energy storageunit, a minimum amount of energy from the transport.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates a Mobile Energy Storage Unit system overview,according to example embodiments.

FIG. 1B illustrates a Mobile Energy Storage Unit routing example,according to example embodiments.

FIG. 1C illustrates a routing table example, according to exampleembodiments.

FIG. 2A illustrates a transport network diagram, according to exampleembodiments.

FIG. 2B illustrates another transport network diagram, according toexample embodiments.

FIG. 2C illustrates yet another transport network diagram, according toexample embodiments.

FIG. 3A illustrates a flow diagram, according to example embodiments.

FIG. 4 illustrates a machine learning transport network diagram,according to example embodiments.

FIG. 5A illustrates an example vehicle configuration for managingdatabase transactions associated with a vehicle, according to exampleembodiments.

FIG. 5B illustrates another example vehicle configuration for managingdatabase transactions conducted among various vehicles, according toexample embodiments

FIG. 6A illustrates a blockchain architecture configuration, accordingto example embodiments.

FIG. 6B illustrates another blockchain configuration, according toexample embodiments.

FIG. 6C illustrates a blockchain configuration for storing blockchaintransaction data, according to example embodiments.

FIG. 6D illustrates example data blocks, according to exampleembodiments.

FIG. 7 illustrates an example system that supports one or more of theexample embodiments.

DETAILED DESCRIPTION

It will be readily understood that the instant components, as generallydescribed and illustrated in the figures herein, may be arranged anddesigned in a wide variety of different configurations. Thus, thefollowing detailed description of the embodiments of at least one of amethod, apparatus, non-transitory computer readable medium and system,as represented in the attached figures, is not intended to limit thescope of the application as claimed but is merely representative ofselected embodiments.

The instant features, structures, or characteristics as describedthroughout this specification may be combined in any suitable manner inone or more embodiments. For example, the usage of the phrases “exampleembodiments”, “some embodiments”, or other similar language, throughoutleast this specification refers to the fact that a particular feature,structure, or characteristic described in connection with the embodimentmay be included in at one embodiment. Thus, appearances of the phrases“example embodiments”, “in some embodiments”, “in other embodiments”, orother similar language, throughout this specification do not necessarilyall refer to the same group of embodiments, and the described features,structures, or characteristics may be combined in any suitable manner inone or more embodiments. In the diagrams, any connection betweenelements can permit one-way and/or two-way communication even if thedepicted connection is a one-way or two-way arrow. In the currentsolution, a transport may include one or more of cars, trucks, walkingarea battery electric vehicle (BEV), e-Palette, fuel cell bus,motorcycles, scooters, bicycles, boats, recreational vehicles, planes,and any object that may be used to transport people and or goods fromone location to another.

In addition, while the term “message” may have been used in thedescription of embodiments, the application may be applied to many typesof network data, such as, a packet, frame, datagram, etc. The term“message” also includes packet, frame, datagram, and any equivalentsthereof. Furthermore, while certain types of messages and signaling maybe depicted in exemplary embodiments they are not limited to a certaintype of message, and the application is not limited to a certain type ofsignaling.

Example embodiments provide methods, systems, components, non-transitorycomputer readable media, devices, and/or networks, which provide atleast one of: a transport (also referred to as a vehicle herein) a datacollection system, a data monitoring system, a verification system, anauthorization system and a vehicle data distribution system. The vehiclestatus condition data, received in the form of communication updatemessages, such as wireless data network communications and/or wiredcommunication messages, may be received and processed to identifyvehicle/transport status conditions and provide feedback as to thecondition changes of a transport. In one example, a user profile may beapplied to a particular transport/vehicle to authorize a current vehicleevent, service stops at service stations, and to authorize subsequentvehicle rental services.

Within the communication infrastructure, a decentralized database is adistributed storage system, which includes multiple nodes thatcommunicate with each other. A blockchain is an example of adecentralized database, which includes an append-only immutable datastructure (i.e. a distributed ledger) capable of maintaining recordsbetween untrusted parties. The untrusted parties are referred to hereinas peers, nodes or peer nodes. Each peer maintains a copy of thedatabase records and no single peer can modify the database recordswithout a consensus being reached among the distributed peers. Forexample, the peers may execute a consensus protocol to validateblockchain storage entries, group the storage entries into blocks, andbuild a hash chain via the blocks. This process forms the ledger byordering the storage entries, as is necessary, for consistency. In apublic or permissionless blockchain, anyone can participate without aspecific identity. Public blockchains can involve cryptocurrencies anduse consensus based on various protocols such as proof of work (PoW). Onthe other hand, a permissioned blockchain database provides a system,which can secure interactions among a group of entities, which share acommon goal, but which do not or cannot fully trust one another, such asbusinesses that exchange funds, goods, information, and the like. Theinstant solution can function in a permissioned and/or a permissionlessblockchain setting.

Smart contracts are trusted distributed applications, which leveragetamper-proof properties of the shared or distributed ledger (i.e., whichmay be in the form of a blockchain) database and an underlying agreementbetween member nodes, which is referred to as an endorsement orendorsement policy. In general, blockchain entries are “endorsed” beforebeing committed to the blockchain while entries, which are not endorsedare disregarded. A typical endorsement policy allows smart contractexecutable code to specify endorsers for an entry in the form of a setof peer nodes that are necessary for endorsement. When a client sendsthe entry to the peers specified in the endorsement policy, the entry isexecuted to validate the entry. After validation, the entries enter anordering phase in which a consensus protocol is used to produce anordered sequence of endorsed entries grouped into blocks.

Nodes are the communication entities of the blockchain system. A “node”may perform a logical function in the sense that multiple nodes ofdifferent types can run on the same physical server. Nodes are groupedin trust domains and are associated with logical entities that controlthem in various ways. Nodes may include different types, such as aclient or submitting-client node, which submits an entry-invocation toan endorser (e.g., peer), and broadcasts entry-proposals to an orderingservice (e.g., ordering node). Another type of node is a peer node,which can receive client submitted entries, commit the entries andmaintain a state and a copy of the ledger of blockchain entries. Peerscan also have the role of an endorser, although it is not a requirement.An ordering-service-node or orderer is a node running the communicationservice for all nodes, and which implements a delivery guarantee, suchas a broadcast to each of the peer nodes in the system when committingentries and modifying a world state of the blockchain, which is anothername for the initial blockchain entry, which normally includes controland setup information.

A ledger is a sequenced, tamper-resistant record of all statetransitions of a blockchain. State transitions may result from smartcontract executable code invocations (i.e., entries) submitted byparticipating parties (e.g., client nodes, ordering nodes, endorsernodes, peer nodes, etc.). An entry may result in a set of assetkey-value pairs being committed to the ledger as one or more operands,such as creates, updates, deletes, and the like. The ledger includes ablockchain (also referred to as a chain), which is used to store animmutable, sequenced record in blocks. The ledger also includes a statedatabase, which maintains a current state of the blockchain. There istypically one ledger per channel. Each peer node maintains a copy of theledger for each channel of which they are a member.

A chain is an entry log structured as hash-linked blocks, and each blockcontains a sequence of N entries where N is equal to or greater thanone. The block header includes a hash of the block's entries, as well asa hash of the prior block's header. In this way, all entries on theledger may be sequenced and cryptographically linked together.Accordingly, it is not possible to tamper with the ledger data withoutbreaking the hash links. A hash of a most recently added blockchainblock represents every entry on the chain that has come before it,making it possible to ensure that all peer nodes are in a consistent andtrusted state. The chain may be stored on a peer node file system (i.e.,local, attached storage, cloud, etc.), efficiently supporting theappend-only nature of the blockchain workload.

The current state of the immutable ledger represents the latest valuesfor all keys that are included in the chain entry log. Because thecurrent state represents the latest key values known to a channel, it issometimes referred to as a world state. Smart contract executable codeinvocations execute entries against the current state data of theledger. To make these smart contract executable code interactionsefficient, the latest values of the keys may be stored in a statedatabase. The state database may be simply an indexed view into thechain's entry log, it can therefore be regenerated from the chain at anytime. The state database may automatically be recovered (or generated ifneeded) upon peer node startup, and before entries are accepted.

A blockchain is different from a traditional database in that theblockchain is not a central storage but rather a decentralized,immutable, and secure storage, where nodes must share in changes torecords in the storage. Some properties that are inherent in blockchainand which help implement the blockchain include, but are not limited to,an immutable ledger, smart contracts, security, privacy,decentralization, consensus, endorsement, accessibility, and the like.

Example embodiments provide a way for providing a vehicle service to aparticular vehicle and/or requesting user associated with a user profilethat is applied to the vehicle. For example, a user may be the owner ofa vehicle or the operator of a vehicle owned by another party. Thevehicle may require service at certain intervals and the service needsmay require authorization prior to permitting the services to bereceived. Also, service centers may offer services to vehicles in anearby area based on the vehicle's current route plan and a relativelevel of service requirements (e.g., immediate, severe, intermediate,minor, etc.). The vehicle needs may be monitored via one or moresensors, which report sensed data to a central controller computerdevice in the vehicle, which in turn, is forwarded to a managementserver for review and action. A sensor may be located on one or more ofthe interior of the transport, the exterior of the transport, on a fixedobject apart from the transport, and on another transport near to thetransport. The sensor may also be associated with the transport's speed,the transport's braking, the transport's acceleration, fuel levels,service needs, the gear-shifting of the transport, the transport'ssteering, and the like. The notion of a sensor may also be a device,such as a mobile device. Also, sensor information may be used toidentify whether the vehicle is operating safely and whether theoccupant user has engaged in any unexpected vehicle conditions, such asduring the vehicle access period. Vehicle information collected before,during and/or after a vehicle's operation may be identified and storedin a transaction on a shared/distributed ledger, which may be generatedand committed to the immutable ledger as determined by a permissiongranting consortium, and thus in a “decentralized” manner, such as via ablockchain membership group.

Each interested party (i.e., company, agency, etc.) may want to limitthe exposure of private information, and therefore the blockchain andits immutability can limit the exposure and manage permissions for eachparticular user vehicle profile. A smart contract may be used to providecompensation, quantify a user profile score/rating/review, apply vehicleevent permissions, determine when service is needed, identify acollision and/or degradation event, identify a safety concern event,identify parties to the event and provide distribution to registeredentities seeking access to such vehicle event data. Also, the resultsmay be identified, and the necessary information can be shared among theregistered companies and/or individuals based on a “consensus” approachassociated with the blockchain. Such an approach could not beimplemented on a traditional centralized database.

Autonomous driving system utilize software and an array of sensors.Machine learning, sensors including cameras, can be utilized to allow aself-driving car to navigate.

In another embodiment, GPS, maps and other cameras and sensors are usedin autonomous vehicles without lidar as lidar is often viewed as beingexpensive and unnecessary. Researchers have determined that stereocameras are a low-cost alternative to the more expensive lidarfunctionality.

The instant solution includes, in certain embodiments, authorizing avehicle for service via an automated and quick authentication scheme.For example, driving up to a charging station or fuel pump may beperformed by a vehicle operator and the authorization to receive chargeor fuel may be performed without any delays provided the authorizationis received by the service station. A vehicle may provide acommunication signal that provides an identification of a vehicle thathas a currently active profile linked to an account that is authorizedto accept a service, which can be later rectified by compensation.Additional measures may be used to provide further authentication, suchas another identifier may be sent from the user's device wirelessly tothe service center to replace or supplement the first authorizationeffort between the transport and the service center with an additionalauthorization effort.

Data shared and received may be stored in a database, which maintainsdata in one single database (e.g., database server) and generally at oneparticular location. This location is often a central computer, forexample, a desktop central processing unit (CPU), a server CPU, or amainframe computer. Information stored on a centralized database istypically accessible from multiple different points. A centralizeddatabase is easy to manage, maintain, and control, especially forpurposes of security because of its single location. Within acentralized database, data redundancy is minimized as a single storingplace of all data also implies that a given set of data only has oneprimary record.

The grid or another area associated with the grid that stores power, inone embodiment of the current solution, communicates with a network andmay be implemented through a computer associated with the grid, suchthat the grid computer sends a message to a server, wherein each of thegrid computer and the server are communicably coupled to the network.The network may be a data network such as the global internet, or anyother similar network. The message contains a request for surplusenergy. The server, in one embodiment, notifies a Mobile Energy StorageUnit (MESU) of the request.

The MESU is a mobile transport that is capable of storing electriccharge and is connected to the grid and/or transports via a wired orwireless connection. The MESU may be a transport that carries occupants,goods, etc., or may be a transport that is smaller in size, usedprimarily to store charge from other devices. The MESU may be able totravel along many different areas, in addition to a normal road,including a sidewalk, a path, and the like. In a wired connection, theelectric vehicle has a charging port and may be plugged into manydifferent types of charging stations that are broken down (in NorthAmerica) into three levels: Level 1, which is the charger available tocharge an electric vehicle using the standard equipment included withthe transport. The chargers are plugged with one end of the chargerbeing plugged into any standard 120 volt outlet, and the other endplugged into the transport. This type of port is capable of charging 200km in 20 hours. Level 2 include chargers that are plugged into a 240volt outlet and are capable of charging 200 km in about 5 hours, or 400in about 11 hours. Level 3 chargers are solely supported by Teslavehicles and are capable of charging 80% of 200 km in about 30 minutesor 80% of 400 km in approximately 1 hour. In a wireless connection, thetransfer of charge from the transport to another object is achieved viaat least two distinct methods: inductive and capacitive transfer. Ininductive transfer, magnetic field coupling between multiple conductingelements is utilized to transfer energy and in capacitive transfer,electric field coupling between conducting elements are used to transferthe energy.

In one embodiment, the MESU is capable of storing a greater amount ofstorage than a regular electric transport. The MESU also is capable ofconnecting to other electric transports and receive charge from theother transports. The MESU may be autonomous, semi-autonomous, ornon-autonomous.

As electric transports become more popular, the technology of generatingcharge while the electric transport is in motion is maturing. Currently,there are different methods wherein an electric transport can generatecharge. Regenerative braking, a first discussed method, is a methodwhere a transport will generate a charge when the transport is braking.Traditional braking systems produce friction between the brake pads andthe brake rotors to slow or stop the transport. When running backwards,the motor also acts as an electric generator to produce electricity thatis directed to the transport's batteries. Solar technology, a seconddiscussed method, panel technology is being used more and more toprovide power to transports, as the panels provide one of the leastexpensive method to charge an electric transport. Estimates show thatthis method can be 50% cheaper than obtaining power from the grid.

In one embodiment, the server informs a MESU of a need for surplusenergy. The MESU determines a route to obtain surplus energy fromtransports, then deliver the stored energy to the grid, via a devicesuch as a vehicle power conversion unit, further described below. TheMESU travels along a path, gathers and stores energy from othertransports then transfers the energy at another location, such as acharging station associated with the grid, to be placed into the grid.This MESU, being mobile in nature, allows for the gathering and storageof energy from other transports without requiring the transport to bemoved. The MESU and/or the server determines a route to obtain energyfrom transports that have a surplus energy while traveling the shortestdistance between the transports.

In one embodiment, the MESU gathers energy from transports that have anexcess of energy, such as those transports that may generate energy atthe transport and are not plugged into the grid charging. In anotherembodiment, the MESU will obtain charge from other transports, andprovide the energy to one or more of other transports, and the grid atanother time, such as when the grid will require surplus charge.

Data from the transports are sent to a system of the current applicationeither when requested or at predetermined intervals. The data comprisesthe current charge of the transport, whether the transport is currentlyplugged in, an approximate time that the transport will next be used andan amount of stored energy at that time, and an amount of energyrequired at that time, the distance from the current location of theMESU, and the distance to the grid. The amount of available charge for atransport is determined as follows: (Amount of Charge at NextUse)−(Amount of Charge Needed at Next Use)

FIG. 1A illustrates a Mobile Energy Storage Unit system overview 100,according to example embodiments. A server 104 communicably coupled to anetwork 102 is used to determine, among other things, an optimal pathfor a MESU 106 to travel and gather and store the greatest amount ofenergy in a minimal amount of time, in one embodiment. The transports inthe system T1-T5 108-116, the grid 118, and the MESU 106 are connectedto the network 102. The grid 118 refers to a station associated with anelectric grid and is capable of receiving a charge from an object (wiredor wirelessly), such as a transport or MESU. Additional or fewertransports other than those depicted may be part of the system withoutdeviating from the scope of the current application.

The MESU 106 is a transport that can store energy containing at leastone connection port, allowing a connection to different transports togather and store energy. The MESU 106 has a connection to the network102, allowing it to transfer and receive data such as notifications andrequests.

The MESU 106 connects to the transport(s) via a connection port, as isusually utilized to charge electric vehicles. In one embodiment, avehicle power conversion unit in the MESU manages the flow of energy asit is connected to other sources to obtain energy, and to the grid todistribute energy. A controller on the MESU is used to control theamount of energy flowing in and out of the MESU. The MESU 106communicates with the network 102, wherein communication includesinstructions of the amount of permissioned energy to obtain.

The transports 108-116, MESU 106, and the grid 118 are connected to anetwork 102 such as a global network or Internet via a suitable wirelesscommunication protocol, such as a wireless telephony (e.g. GSM, CDMA,LTE, etc.), Wi-Fi (802.11 standards), WiMAX, Bluetooth, infrared orradio frequency communications, etc. A server is communicably coupled tothe network, which is used, among other functions, to store data fromthe elements of the system, such as the transports, the grid, and theMESU, in one embodiment. Additional code in a processor associated withthe server may in executed to perform requests and generate responses,to other elements in the system, such as the grid 118, the transports108-116, and the MESU 106. A database (not depicted) may be communicablycoupled to the server 104 to store data about the functions of thecurrent system.

The transports 108-116 send data to the server 104 via the network 102at predefined intervals, in one embodiment. The data includesinformation about the use of the transports, idle time, current andpredicted charge levels, as well as information about the future use ofthe transport, such as upcoming events and scheduled appointments. Inone embodiment, the transports 108-116 and/or the server 104 interfacewith Application Programming Interfaces (APIs) of a calendar applicationassociated with occupants of the transports 108-116 to determineupcoming, scheduled events on the driver/occupants calendar. Querying acalendar application via APIs, the system can determine if there are anyirregular destinations upcoming. The system also determines regularroutes and regular times by recording daily routes of the transport.Therefore, it can determine how long the transport may be parked at aparticular location, and an approximate time when the transport will bein use. The MESU 106 connects to the transports 108-116 to transfer andstore any surplus energy in the transports.

In a further embodiment, the system receives data about the grid such asdays when the grid will, at a predetermined time, submit data aboutneeds for surplus energy. In another embodiment, the system queries thegrid, such as via the interfacing with APIs therein.

Now referring to FIG. 1B, a MESU routing example 120, according toexample embodiments. A MESU 106 obtaining surplus charge from transportsand transferring the stored energy to a grid. In conjunction with theserver 104, the MESU 106 determines a route that will obtain a maximumamount of charge from transports then discharge the stored charge at agrid 118. The determination of the route is based on multiple factorsthat are described herein.

In one embodiment, the MESU will examine transports that are not pluggedin and have surplus charge to provide back to the grid. This may be asurplus of charge in the transport, wherein the transport is not needingthe additional charge to arrive at their next destination. The surpluscharge may be from the transport generating additional charge fromdifferent methods, such as regenerative braking, solar power charge,and/or the like. To determine how much charge the transport will needafter any surplus charge has been taken (referred herein as “remainingcharge”), the MESU 106, in one embodiment, communicates with a server104. The server 104 communicates with the transports, as furtherdescribed herein, to determine an amount of surplus charge in therespective transports. The MESU 106 creates a route according to whichtransport are available, are in proximity to the MESU 106, and have asurplus of charge to provide to the MESU 106.

In another embodiment, the server 104 will adjust the remaining chargeaccording to the current environment, such as current traffic and/orweather on the route to the transport's next destination. Also, thecondition of the transport and the like may be used to assist the server104 to determine the remaining charge.

As an example, the MESU 106 follows Route A 122, transport 1 (T1) 108 isthe nearest to the MESU, not charging, and has 35 kWh available assurplus to provide to the MESU. Therefore, the MESU will make thattransport the first stop. The MESU 106 then travels to transport 2 (T2)110, transport 3 (T3) 112, transport 4 (T4) 114, then to the grid 118 toprovide the stored charge back to the grid. The MESU 106, after eachtransfer of charge may (in one embodiment) query the server 104 for themost up-to-date characteristics of the transports in proximity to theMESU 106. The server 104 will then return with a next transport on theroute.

The MESU 106 in correspondence with the server 104 determines transportsthat have surplus charge and determines Route B 124 where it travels totransport 5 (T5) 116, then to transport 2 (T2) 110, the back to the grid118. In another embodiment, the MESU 106 determines the remaining chargeitself.

Now, referring to FIG. 1C, a routing table example 150, according toexample embodiments including a table of transport data 152. This datais sent to the server 104, in one embodiment, wherein the server 106will have data for each transport and have the ability to determine anyavailable surplus charge. This surplus charge is provided to the MESU106. In some embodiments, the server 104 recommends a route for the MESU106, such that the MESU 106 will follow the route provided and makestops at each respective transport 108-114. The MESU 106 will thentravel to the grid 118 to unload the stored charge and continue on itsnext route.

In a further embodiment, when the MESU 106 stops at a transport toobtain surplus charge, an amount of time is passes while the charge istransferred. Each time the MESU 106 continues on the route (such asafter obtaining surplus charge from a transport) the MESU 106 queriesthe server 106 for data related to the up-to-date route, since an amountof time has passed and there may be modifications to the data and othertransports, and therefore modifications to the route.

The table 152 depicts the current charge of the transport, whether thetransport is currently being charged, an amount of charge determined tobe necessary at the transport's next use, an amount of surplus chargethat is available, and the geographic distances, both the distance fromthe MESU's current location, and the geographic distance between thetransport and the electric grid.

In one embodiment, when the MESU 106 is traveling from transport totransport obtaining surplus charge, the MESU is not always traveling ona street or road, but travels on a bike lane, a sidewalk, path or thelike. These are locations where a normal transport does not normallytravel. The MESU 106 provides a capability to augment views, such asaugmenting the street view of the geographic area. This additional viewprovides additional periphery to a current street view. Additionalinformation of the area is also provided, such as a sidewalk needingrepairs, a lawn that is need of maintenance (such as through disease,parasites, additional maintenance due to current water restrictions,broken sprinkler heads that need repair, etc. Furthermore, additionalinformation is provided about packages left on a front area of abuilding, such as a porch. Current street views provide a view of thearea yet are unable to provide more details of the location. With thecurrent embodiment, further details are provided, as well as a moredetailed peripheral view of the location. This additional data is usedto provide delivery personnel specific locations to leave packages, suchas behind a planter, or behind a bush, for example.

In one embodiment, the MESU will only take energy from a transport thatneeds a greater amount of energy to operate as compared to the MESU. Forexample, the MESU would not take energy from a transport such as ascooter, a golf cart, a motorcycle, and the like.

In one embodiment, each transport in the network has opted into anagreement to provide details to a server wherein the details areprovided at regular intervals such that the server can retain anunderstanding of the relatively up-to-date details of the transport. Thedetails may include whether the transport is currently plugged into acharging station, whether the transport is moving, how long thetransport has not been moving, the geographic location of the transport,and the time of day.

In one embodiment, the MESU pings the transport to determine if thetransport is currently in motion and how long the transport has not beenin motion (if not currently in motion). A computer associated with thetransport is in communication with the MESU and provides thisinformation. In another embodiment, the transport is in communicationwith a server such as through a global network such as the internet. TheMESU communicates with the server to determine characteristics of thetransport in the network.

In one embodiment, the MESU scans transports within the network within ageographic area. The MESU queries the server to obtain details oftransports in the network within the geographic area. The MESUdetermines, through the response from the server, which transports arein the network within the geographic area and have a surplus of chargeto provide to the MESU.

In one embodiment, the MESU determines the availability of thetransports within the area. For example, those transports that aregeographically located in a parking lot of business are not available,as the MESU will not be able to park at the transport and avoid impedingtraffic in the parking lot. Those transports that are currently locatedinside a parking garage also would not be available to provide charge.Those transports that are located near a charging station are consideredunavailable, as they may be plugged into the charging station.

In one embodiment, the MESU accounts for periods in the day. The day isbroken up into periods, such as period 1 being from 8 am to 11 am,period 2 being from 11 am to 1 pm, period 3 being from 1 pm to 6 pm, andperiod 4 being from 6 pm to 11 pm. If a transport is not near a chargingstation, parked in an accessible area (such as at a parking lot of acorporate business or the like) and has a surplus of charge, the periodof the day is taken into consideration in the determination of theavailability of the transport. For example, a transport should remainparked if at the beginning of periods 1 and 3. A transport in period 2is not considered available as the transport may soon be utilized, suchas the situation where the operator of the transport is on a lunchbreak. If the MESU is querying transports at the end of period 1 and 3,then those transports may soon be used, such as the situation where theperson may be heading to a destination during a lunch break, forexample. If a transport is parked at a parking lot at the beginning ofperiod 4, then it has a higher probability to be used, as the operatorof the transport may be at dinner, or shopping. In further embodiment,if the transport is parked at a movie theater, and has been idle for ashort amount of time (such as 10 minutes), that transport would beconsidered to be available, as it is most probable that the operator iswatching a movie.

In one embodiment, the MESU determines when it needs to stoptransferring charge from a transport. If the MESU is at a transporttransferring charge from the transport, if the operator of the transportarrives at the transport during this time, the MESU will stop thetransfer upon a determination that the transport is going to be driven.In one embodiment, one or more biometric elements are placed on the MESUsuch that the operator may interact with the one or more elements,allowing the MESU to validate that the person is the operator of thetransport. This informs the MESU to disconnect from the transport andcontinue to another location. In another embodiment, the MESU, throughcommunication with a computer associated with the transport, can detectfunctions of the transport and determine that the transfer should cease.Such as a determination that the driver's door opened and or closed, aseat belt was used to strap an occupant into the transport, aninstruction to initiate the transport, and the like.

In one embodiment, the MESU, through additional elements, can bypass theconditions of stopping the transport. The additional elements mayinclude an audio component wherein the operator can instruct the MESU tocontinue regardless of the functions being performed at the transportthat would normally stop the transfer. In a further embodiment, theoperator may “call out” to the MESU once it disconnects and begins to anext destination. Such as the operator saying a command, such as “don'tdisconnect”, or “continue the transfer”, and the like. In anotherembodiment, the MESU accepts gestures to communicate actions. Anoperator may perform a predefined gesture to instruct the MESU to stop atransfer.

In one embodiment, the MESU contacts an operator of the transport suchas via direct communication via cellular mobility, or through V2Vtechnology or the like. The MESU informs the operator of details relatedto the desired transaction, such as the expected amount of time untilthe MESU arrives at the transport, an estimated amount of time it willtake to transfer the charge, an estimated amount of charge desired, andan estimated time when the transfer will be complete. In yet anotherembodiment, the MESU requests a verification that the transfer can takeplace. The operator, such as via a mobile device associated with theoperator, may either validate the response, or deny the response. In yetanother embodiment, the operator, through the device, can respond with atime when the transfer may take place. In a further embodiment, the MESUnotifies the device associated with the operator of a transfer of valueto the operator in response to the allowance of the MESU to transfercharge from the transport.

In one embodiment, periods during the day are established. These periodsare used by the MESU to determine a likely availability of transports.For example, three periods are defined: a time between 8:00 am and 11:00am (Period 1), a time between 1:00 pm and 5:00 pm (Period 2), and a timebetween 6:00 pm and 10:00 pm (Period 3). By using the periods, the MESUcan predict a higher chance that a transport will be available for acharge transfer. If the current time is between 8:00 am and 9:00 am, thetransport is not connected to a charging station, and is in an availableparking spot, there is a fairly high chance that the transport will beavailable until 11 am. This reflects a normal schedule of a workingprofessional where the transport is used to route to a business, thepark until it is possibly used to travel to a restaurant. The transportroutes back to the business until a time later in the afternoon when itis used to route back to a residence. A MESU is better able to predictan availability of a transport using these periods.

In one embodiment, the MESU considers an average charging rate and apeak charging rate and the amount of time at the average charging rateand the peak charging rate for determining which charging station tomaneuver to, low long to stay at the charging station, how much chargeis to be remaining in the MESU upon leaving the charging station, etc.The average charging rate is the rate of charge over a given period, andthe peak charging rate is the fastest charging kWh over the chargingsession.

FIG. 2A illustrates a transport network diagram 200, according toexample embodiments. The network comprises elements including atransport node 202 including a processor 204, as well as a transportnode 202′ including a processor 204′. The transport nodes 202, 202′communicate with one another via the processors 204, 204′, as well asother elements (not shown) including transceivers, transmitters,receivers, storage, sensors and other elements capable of providingcommunication. The communication between the transport nodes 202, 202′can occur directly, via a private and/or a public network (not shown) orvia other transport nodes and elements comprising one or more of aprocessor, memory, and software. Although depicted as single transportnodes and processors, a plurality of transport nodes and processors maybe present. One or more of the applications, features, steps, solutions,etc., described and/or depicted herein may be utilized and/or providedby the instant elements.

FIG. 2B illustrates another transport network diagram 210, according toexample embodiments. The network comprises elements including atransport node 202 including a processor 204, as well as a transportnode 202′ including a processor 204′. The transport nodes 202, 202′communicate with one another via the processors 204, 204′, as well asother elements (not shown) including transceivers, transmitters,receivers, storage, sensors and other elements capable of providingcommunication. The communication between the transport nodes 202, 202′can occur directly, via a private and/or a public network (not shown) orvia other transport nodes and elements comprising one or more of aprocessor, memory, and software. The processors 204, 204′ can furthercommunicate with one or more elements 230 including sensor 212, wireddevice 214, wireless device 216, database 218, mobile phone 220,transport node 222, computer 224, I/O device 226 and voice application228. The processors 204, 204′ can further communicate with elementscomprising one or more of a processor, memory, and software.

Although depicted as single transport nodes, processors and elements, aplurality of transport nodes, processors and elements may be present.Information or communication can occur to and/or from any of theprocessors 204, 204′ and elements 230. For example, the mobile phone 220may provide information to the processor 204, which may initiate thetransport node 202 to take an action, may further provide theinformation or additional information to the processor 204′, which mayinitiate the transport node 202′ to take an action, may further providethe information or additional information to the mobile phone 220, thetransport node 222, and/or the computer 224. One or more of theapplications, features, steps, solutions, etc., described and/ordepicted herein may be utilized and/or provided by the instant elements.

FIG. 2C illustrates yet another transport network diagram 240, accordingto example embodiments. The network comprises elements including atransport node 202 including a processor 204 and a non-transitorycomputer readable medium 242C. The processor 204 is communicably coupledto the computer readable medium 242C and elements 230 (which weredepicted in FIG. 2B).

The processor 204 performs one or more of maneuvering, by a MobileEnergy Storage Unit (MESU), to a transport that is stationary for anamount of time, that is not currently being charged, that is at adistance between the transport and the MESU and that is within atimeframe for the MESU to reach the transport 242, and retrieving, bythe mobile energy storage unit, a minimum amount of energy from thetransport 244.

The processors and/or computer readable media may fully or partiallyreside in the interior or exterior of the transport nodes. The steps orfeatures stored in the computer readable media may be fully or partiallyperformed by any of the processors and/or elements in any order.Additionally, one or more steps or features may be added, omitted,combined, performed at a later time, etc.

FIG. 3A illustrates a flow diagram 300, according to exampleembodiments. Referring to FIG. 3A, the flow comprises maneuvering 302,by a Mobile Energy Storage Unit (MESU), to a transport that isstationary for an amount of time, that is not currently being charged,that is at a distance between the transport and the MESU and that iswithin a timeframe for the MESU to reach the transport, and retrieving304, by the mobile energy storage unit, a minimum amount of energy fromthe transport.

FIG. 4 illustrates a machine learning transport network diagram 400,according to example embodiments. The network 400 includes a transportnode 402 that interfaces with a machine learning subsystem 406. Thetransport node includes one or more sensors 404.

The machine learning subsystem 406 contains a learning model 408, whichis a mathematical artifact created by a machine learning training system410 that generates predictions by finding patterns in one or moretraining data sets. In some embodiments, the machine learning subsystem406 resides in the transport node 402. In other embodiments, the machinelearning subsystem 406 resides outside of the transport node 402.

The transport node 402 sends data from the one or more sensors 404 tothe machine learning subsystem 406. The machine learning subsystem 406provides the one or more sensor 404 data to the learning model 408,which returns one or more predictions. The machine learning subsystem406 sends one or more instructions to the transport node 402 based onthe predictions from the learning model 408.

In a further embodiment, the transport node 402 may send the one or moresensor data 404 to the machine learning training system 410. In yetanother embodiment, the machine learning subsystem 406 may send thesensor 404 data to the machine learning training subsystem 410. In oneembodiment, the machine learning subsystem 406 and the machine learningtraining subsystem 410 may be one system. One or more of theapplications, features, steps, solutions, etc., described and/ordepicted herein may utilize the machine learning network 400 asdescribed herein.

FIG. 5A illustrates an example vehicle configuration 500 for managingdatabase transactions associated with a vehicle, according to exampleembodiments. Referring to FIG. 5A, as a particular transport/vehicle 525is engaged in transactions (e.g., vehicle service, dealer transactions,delivery/pickup, transportation services, etc.), the vehicle may receiveassets 510 and/or expel/transfer assets 512 according to atransaction(s). A transport processor 526 resides in the vehicle 525 andcommunication exists between the transport processor 526, a database530, a transport processor 526 and the transaction module 520. Thetransaction module 520 may record information, such as assets, parties,credits, service descriptions, date, time, location, results,notifications, unexpected events, etc. Those transactions in thetransaction module 520 may be replicated into a database 530. Thedatabase 530 can be one of a SQL database, an RDBMS, a relationaldatabase, a non-relational database, a blockchain, a distributed ledger,and may be on board the transport, may be off board the transport, maybe accessible directly and/or through a network, or be accessible to thetransport.

FIG. 5B illustrates an example vehicle configuration 550 for managingdatabase transactions conducted among various vehicles, according toexample embodiments. The vehicle 525 may engage with another vehicle 508to perform various actions such as to share, transfer, acquire servicecalls, etc. when the vehicle has reached a status where the servicesneed to be shared with another vehicle. For example, the vehicle 508 maybe due for a battery charge and/or may have an issue with a tire and maybe in route to pick up a package for delivery. A transport processor 528resides in the vehicle 508 and communication exists between thetransport processor 528, a database 554, a transport processor 528 andthe transaction module 552. The vehicle 508 may notify another vehicle525, which is in its network and which operates on its blockchain memberservice. A transport processor 526 resides in the vehicle 525 andcommunication exists between the transport processor 526, a database530, the transport processor 526 and a transaction module 520. Thevehicle 525 may then receive the information via a wirelesscommunication request to perform the package pickup from the vehicle 508and/or from a server (not shown). The transactions are logged in thetransaction modules 552 and 520 of both vehicles. The credits aretransferred from vehicle 508 to vehicle 525 and the record of thetransferred service is logged in the database 530/554 assuming that theblockchains are different from one another, or, are logged in the sameblockchain used by all members. The database 554 can be one of a SQLdatabase, an RDBMS, a relational database, a non-relational database, ablockchain, a distributed ledger, and may be on board the transport, maybe off board the transport, may be accessible directly and/or through anetwork.

FIG. 6A illustrates a blockchain architecture configuration 600,according to example embodiments. Referring to FIG. 6A, the blockchainarchitecture 600 may include certain blockchain elements, for example, agroup of blockchain member nodes 602-606 as part of a blockchain group610. In one example embodiment, a permissioned blockchain is notaccessible to all parties but only to those members with permissionedaccess to the blockchain data. The blockchain nodes participate in anumber of activities, such as blockchain entry addition and validationprocess (consensus). One or more of the blockchain nodes may endorseentries based on an endorsement policy and may provide an orderingservice for all blockchain nodes. A blockchain node may initiate ablockchain action (such as an authentication) and seek to write to ablockchain immutable ledger stored in the blockchain, a copy of whichmay also be stored on the underpinning physical infrastructure.

The blockchain transactions 620 are stored in memory of computers as thetransactions are received and approved by the consensus model dictatedby the members' nodes. Approved transactions 626 are stored in currentblocks of the blockchain and committed to the blockchain via a committalprocedure, which includes performing a hash of the data contents of thetransactions in a current block and referencing a previous hash of aprevious block. Within the blockchain, one or more smart contracts 630may exist that define the terms of transaction agreements and actionsincluded in smart contract executable application code 632, such asregistered recipients, vehicle features, requirements, permissions,sensor thresholds, etc. The code may be configured to identify whetherrequesting entities are registered to receive vehicle services, whatservice features they are entitled/required to receive given theirprofile statuses and whether to monitor their actions in subsequentevents. For example, when a service event occurs and a user is riding inthe vehicle, the sensor data monitoring may be triggered, and a certainparameter, such as a vehicle charge level, may be identified as beingabove/below a particular threshold for a particular period of time, thenthe result may be a change to a current status, which requires an alertto be sent to the managing party (i.e., vehicle owner, vehicle operator,server, etc.) so the service can be identified and stored for reference.The vehicle sensor data collected may be based on types of sensor dataused to collect information about vehicle's status. The sensor data mayalso be the basis for the vehicle event data 634, such as a location(s)to be traveled, an average speed, a top speed, acceleration rates,whether there were any collisions, was the expected route taken, what isthe next destination, whether safety measures are in place, whether thevehicle has enough charge/fuel, etc. All such information may be thebasis of smart contract terms 630, which are then stored in ablockchain. For example, sensor thresholds stored in the smart contractcan be used as the basis for whether a detected service is necessary andwhen and where the service should be performed.

FIG. 6B illustrates a shared ledger configuration, according to exampleembodiments. Referring to FIG. 6B, the blockchain logic example 640includes a blockchain application interface 642 as an API or plug-inapplication that links to the computing device and execution platformfor a particular transaction. The blockchain configuration 640 mayinclude one or more applications, which are linked to applicationprogramming interfaces (APIs) to access and execute storedprogram/application code (e.g., smart contract executable code, smartcontracts, etc.), which can be created according to a customizedconfiguration sought by participants and can maintain their own state,control their own assets, and receive external information. This can bedeployed as an entry and installed, via appending to the distributedledger, on all blockchain nodes.

The smart contract application code 644 provides a basis for theblockchain transactions by establishing application code, which whenexecuted causes the transaction terms and conditions to become active.The smart contract 630, when executed, causes certain approvedtransactions 626 to be generated, which are then forwarded to theblockchain platform 652. The platform includes a security/authorization658, computing devices, which execute the transaction management 656 anda storage portion 654 as a memory that stores transactions and smartcontracts in the blockchain.

The blockchain platform may include various layers of blockchain data,services (e.g., cryptographic trust services, virtual executionenvironment, etc.), and underpinning physical computer infrastructurethat may be used to receive and store new entries and provide access toauditors, which are seeking to access data entries. The blockchain mayexpose an interface that provides access to the virtual executionenvironment necessary to process the program code and engage thephysical infrastructure. Cryptographic trust services may be used toverify entries such as asset exchange entries and keep informationprivate.

The blockchain architecture configuration of FIGS. 6A and 6B may processand execute program/application code via one or more interfaces exposed,and services provided, by the blockchain platform. As a non-limitingexample, smart contracts may be created to execute reminders, updates,and/or other notifications subject to the changes, updates, etc. Thesmart contracts can themselves be used to identify rules associated withauthorization and access requirements and usage of the ledger. Forexample, the information may include a new entry, which may be processedby one or more processing entities (e.g., processors, virtual machines,etc.) included in the blockchain layer. The result may include adecision to reject or approve the new entry based on the criteriadefined in the smart contract and/or a consensus of the peers. Thephysical infrastructure may be utilized to retrieve any of the data orinformation described herein.

Within smart contract executable code, a smart contract may be createdvia a high-level application and programming language, and then writtento a block in the blockchain. The smart contract may include executablecode that is registered, stored, and/or replicated with a blockchain(e.g., distributed network of blockchain peers). An entry is anexecution of the smart contract code, which can be performed in responseto conditions associated with the smart contract being satisfied. Theexecuting of the smart contract may trigger a trusted modification(s) toa state of a digital blockchain ledger. The modification(s) to theblockchain ledger caused by the smart contract execution may beautomatically replicated throughout the distributed network ofblockchain peers through one or more consensus protocols.

The smart contract may write data to the blockchain in the format ofkey-value pairs. Furthermore, the smart contract code can read thevalues stored in a blockchain and use them in application operations.The smart contract code can write the output of various logic operationsinto the blockchain. The code may be used to create a temporary datastructure in a virtual machine or other computing platform. Data writtento the blockchain can be public and/or can be encrypted and maintainedas private. The temporary data that is used/generated by the smartcontract is held in memory by the supplied execution environment, thendeleted once the data needed for the blockchain is identified.

A smart contract executable code may include the code interpretation ofa smart contract, with additional features. As described herein, thesmart contract executable code may be program code deployed on acomputing network, where it is executed and validated by chainvalidators together during a consensus process. The smart contractexecutable code receives a hash and retrieves from the blockchain a hashassociated with the data template created by use of a previously storedfeature extractor. If the hashes of the hash identifier and the hashcreated from the stored identifier template data match, then the smartcontract executable code sends an authorization key to the requestedservice. The smart contract executable code may write to the blockchaindata associated with the cryptographic details.

FIG. 6C illustrates a blockchain configuration for storing blockchaintransaction data, according to example embodiments. Referring to FIG.6C, the example configuration 660 provides for the vehicle 662, the userdevice 664 and a server 666 sharing information with a distributedledger (i.e., blockchain) 668. The server may represent a serviceprovider entity inquiring with a vehicle service provider to share userprofile rating information in the event that a known and establisheduser profile is attempting to rent a vehicle with an established ratedprofile. The server 666 may be receiving and processing data related toa vehicle's service requirements. As the service events occur, such asthe vehicle sensor data indicates a need for fuel/charge, a maintenanceservice, etc., a smart contract may be used to invoke rules, thresholds,sensor information gathering, etc., which may be used to invoke thevehicle service event. The blockchain transaction data 670 is saved foreach transaction, such as the access event, the subsequent updates to avehicle's service status, event updates, etc. The transactions mayinclude the parties, the requirements (e.g., 18 years of age, serviceeligible candidate, valid driver's license, etc.), compensation levels,the distance traveled during the event, the registered recipientspermitted to access the event and host a vehicle service,rights/permissions, sensor data retrieved during the vehicle eventoperation to log details of the next service event and identify avehicle's condition status, and thresholds used to make determinationsabout whether the service event was completed and whether the vehicle'scondition status has changed.

FIG. 6D illustrates blockchain blocks 680 that can be added to adistributed ledger, according to example embodiments, and contents ofblock structures 682A to 682 n. Referring to FIG. 6D, clients (notshown) may submit entries to blockchain nodes to enact activity on theblockchain. As an example, clients may be applications that act onbehalf of a requester, such as a device, person or entity to proposeentries for the blockchain. The plurality of blockchain peers (e.g.,blockchain nodes) may maintain a state of the blockchain network and acopy of the distributed ledger. Different types of blockchainnodes/peers may be present in the blockchain network including endorsingpeers, which simulate and endorse entries proposed by clients andcommitting peers which verify endorsements, validate entries, and commitentries to the distributed ledger. In this example, the blockchain nodesmay perform the role of endorser node, committer node, or both.

The instant system includes a blockchain that stores immutable,sequenced records in blocks, and a state database (current world state)maintaining a current state of the blockchain. One distributed ledgermay exist per channel and each peer maintains its own copy of thedistributed ledger for each channel of which they are a member. Theinstant blockchain is an entry log, structured as hash-linked blockswhere each block contains a sequence of N entries. Blocks may includevarious components such as those shown in FIG. 6D. The linking of theblocks may be generated by adding a hash of a prior block's headerwithin a block header of a current block. In this way, all entries onthe blockchain are sequenced and cryptographically linked togetherpreventing tampering with blockchain data without breaking the hashlinks. Furthermore, because of the links, the latest block in theblockchain represents every entry that has come before it. The instantblockchain may be stored on a peer file system (local or attachedstorage), which supports an append-only blockchain workload.

The current state of the blockchain and the distributed ledger may bestored in the state database. Here, the current state data representsthe latest values for all keys ever included in the chain entry log ofthe blockchain. Smart contract executable code invocations executeentries against the current state in the state database. To make thesesmart contract executable code interactions extremely efficient, thelatest values of all keys are stored in the state database. The statedatabase may include an indexed view into the entry log of theblockchain, it can therefore be regenerated from the chain at any time.The state database may automatically get recovered (or generated ifneeded) upon peer startup, before entries are accepted.

Endorsing nodes receive entries from clients and endorse the entry basedon simulated results. Endorsing nodes hold smart contracts, whichsimulate the entry proposals. When an endorsing node endorses an entry,the endorsing nodes creates an entry endorsement, which is a signedresponse from the endorsing node to the client application indicatingthe endorsement of the simulated entry. The method of endorsing an entrydepends on an endorsement policy that may be specified within smartcontract executable code. An example of an endorsement policy is “themajority of endorsing peers must endorse the entry.” Different channelsmay have different endorsement policies. Endorsed entries are forward bythe client application to an ordering service.

The ordering service accepts endorsed entries, orders them into a block,and delivers the blocks to the committing peers. For example, theordering service may initiate a new block when a threshold of entrieshas been reached, a timer times out, or another condition. In thisexample, blockchain node is a committing peer that has received a datablock 682A for storage on the blockchain. The ordering service may bemade up of a cluster of orderers. The ordering service does not processentries, smart contracts, or maintain the shared ledger. Rather, theordering service may accept the endorsed entries and specifies the orderin which those entries are committed to the distributed ledger. Thearchitecture of the blockchain network may be designed such that thespecific implementation of ‘ordering’ (e.g., Solo, Kafka, BFT, etc.)becomes a pluggable component.

Entries are written to the distributed ledger in a consistent order. Theorder of entries is established to ensure that the updates to the statedatabase are valid when they are committed to the network. Unlike acryptocurrency blockchain system (e.g., Bitcoin, etc.) where orderingoccurs through the solving of a cryptographic puzzle, or mining, in thisexample the parties of the distributed ledger may choose the orderingmechanism that best suits that network.

Referring to FIG. 6D, a block 682A (also referred to as a data block)that is stored on the blockchain and/or the distributed ledger mayinclude multiple data segments such as a block header 684A to 684 n,transaction specific data 686A to 686 n, and block metadata 688A to 688n. It should be appreciated that the various depicted blocks and theircontents, such as block 682A and its contents are merely for purposes ofan example and are not meant to limit the scope of the exampleembodiments. In some cases, both the block header 684A and the blockmetadata 688A may be smaller than the transaction specific data 686A,which stores entry data; however, this is not a requirement. The block682A may store transactional information of N entries (e.g., 100, 500,1000, 2000, 3000, etc.) within the block data 690A to 690 n. The block682A may also include a link to a previous block (e.g., on theblockchain) within the block header 684A. In particular, the blockheader 684A may include a hash of a previous block's header. The blockheader 684A may also include a unique block number, a hash of the blockdata 690A of the current block 682A, and the like. The block number ofthe block 682A may be unique and assigned in an incremental/sequentialorder starting from zero. The first block in the blockchain may bereferred to as a genesis block, which includes information about theblockchain, its members, the data stored therein, etc.

The block data 690A may store entry information of each entry that isrecorded within the block. For example, the entry data may include oneor more of a type of the entry, a version, a timestamp, a channel ID ofthe distributed ledger, an entry ID, an epoch, a payload visibility, asmart contract executable code path (deploy tx), a smart contractexecutable code name, a smart contract executable code version, input(smart contract executable code and functions), a client (creator)identify such as a public key and certificate, a signature of theclient, identities of endorsers, endorser signatures, a proposal hash,smart contract executable code events, response status, namespace, aread set (list of key and version read by the entry, etc.), a write set(list of key and value, etc.), a start key, an end key, a list of keys,a Merkel tree query summary, and the like. The entry data may be storedfor each of the N entries.

In some embodiments, the block data 690A may also store transactionspecific data 686A, which adds additional information to the hash-linkedchain of blocks in the blockchain. Accordingly, the data 686A can bestored in an immutable log of blocks on the distributed ledger. Some ofthe benefits of storing such data 686A are reflected in the variousembodiments disclosed and depicted herein. The block metadata 688A maystore multiple fields of metadata (e.g., as a byte array, etc.).Metadata fields may include signature on block creation, a reference toa last configuration block, an entry filter identifying valid andinvalid entries within the block, last offset persisted of an orderingservice that ordered the block, and the like. The signature, the lastconfiguration block, and the orderer metadata may be added by theordering service. Meanwhile, a committer of the block (such as ablockchain node) may add validity/invalidity information based on anendorsement policy, verification of read/write sets, and the like. Theentry filter may include a byte array of a size equal to the number ofentries in the block data 610A and a validation code identifying whetheran entry was valid/invalid.

The other blocks 682B to 682 n in the blockchain also have headers,files, and values. However, unlike the first block 682A, each of theheaders 684A to 684 n in the other blocks includes the hash value of animmediately preceding block. The hash value of the immediately precedingblock may be just the hash of the header of the previous block or may bethe hash value of the entire previous block. By including the hash valueof a preceding block in each of the remaining blocks, a trace can beperformed from the Nth block back to the genesis block (and theassociated original file) on a block-by-block basis, as indicated byarrows 692, to establish an auditable and immutable chain-of-custody.

The above embodiments may be implemented in hardware, in a computerprogram executed by a processor, in firmware, or in a combination of theabove. A computer program may be embodied on a computer readable medium,such as a storage medium. For example, a computer program may reside inrandom access memory (“RAM”), flash memory, read-only memory (“ROM”),erasable programmable read-only memory (“EPROM”), electrically erasableprogrammable read-only memory (“EEPROM”), registers, hard disk, aremovable disk, a compact disk read-only memory (“CD-ROM”), or any otherform of storage medium known in the art.

An exemplary storage medium may be coupled to the processor such thatthe processor may read information from, and write information to, thestorage medium. In the alternative, the storage medium may be integralto the processor. The processor and the storage medium may reside in anapplication specific integrated circuit (“ASIC”). In the alternative,the processor and the storage medium may reside as discrete components.For example, FIG. 7 illustrates an example computer system architecture700, which may represent or be integrated in any of the above-describedcomponents, etc.

FIG. 7 is not intended to suggest any limitation as to the scope of useor functionality of embodiments of the application described herein.Regardless, the computing node 700 is capable of being implementedand/or performing any of the functionality set forth hereinabove.

In computing node 700 there is a computer system/server 702, which isoperational with numerous other general purpose or special purposecomputing system environments or configurations. Examples of well-knowncomputing systems, environments, and/or configurations that may besuitable for use with computer system/server 702 include, but are notlimited to, personal computer systems, server computer systems, thinclients, thick clients, hand-held or laptop devices, multiprocessorsystems, microprocessor-based systems, set top boxes, programmableconsumer electronics, network PCs, minicomputer systems, mainframecomputer systems, and distributed cloud computing environments thatinclude any of the above systems or devices, and the like.

Computer system/server 702 may be described in the general context ofcomputer system-executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 702 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 7 , computer system/server 702 in cloud computing node700 is shown in the form of a general-purpose computing device. Thecomponents of computer system/server 702 may include, but are notlimited to, one or more processors or processing units 704, a systemmemory 706, and a bus that couples various system components includingsystem memory 706 to processor 704.

The bus represents one or more of any of several types of busstructures, including a memory bus or memory controller, a peripheralbus, an accelerated graphics port, and a processor or local bus usingany of a variety of bus architectures. By way of example, and notlimitation, such architectures include Industry Standard Architecture(ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA)bus, Video Electronics Standards Association (VESA) local bus, andPeripheral Component Interconnects (PCI) bus.

Computer system/server 702 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 702, and it includes both volatileand non-volatile media, removable and non-removable media. System memory706, in one embodiment, implements the flow diagrams of the otherfigures. The system memory 706 can include computer system readablemedia in the form of volatile memory, such as random-access memory (RAM)708 and/or cache memory 710. Computer system/server 702 may furtherinclude other removable/non-removable, volatile/non-volatile computersystem storage media. By way of example only, memory 706 can be providedfor reading from and writing to a non-removable, non-volatile magneticmedia (not shown and typically called a “hard drive”). Although notshown, a magnetic disk drive for reading from and writing to aremovable, non-volatile magnetic disk (e.g., a “floppy disk”), and anoptical disk drive for reading from or writing to a removable,non-volatile optical disk such as a CD-ROM, DVD-ROM or other opticalmedia can be provided. In such instances, each can be connected to thebus by one or more data media interfaces. As will be further depictedand described below, memory 706 may include at least one program producthaving a set (e.g., at least one) of program modules that are configuredto carry out the functions of various embodiments of the application.

Program/utility, having a set (at least one) of program modules, may bestored in memory 706 by way of example, and not limitation, as well asan operating system, one or more application programs, other programmodules, and program data. Each of the operating system, one or moreapplication programs, other program modules, and program data or somecombination thereof, may include an implementation of a networkingenvironment. Program modules generally carry out the functions and/ormethodologies of various embodiments of the application as describedherein.

As will be appreciated by one skilled in the art, aspects of the presentapplication may be embodied as a system, method, or computer programproduct. Accordingly, aspects of the present application may take theform of an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present application may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Computer system/server 702 may also communicate with one or moreexternal devices via an I/O device 712 (such as an I/O adapter), whichmay include a keyboard, a pointing device, a display, a voicerecognition module, etc., one or more devices that enable a user tointeract with computer system/server 702, and/or any devices (e.g.,network card, modem, etc.) that enable computer system/server 702 tocommunicate with one or more other computing devices. Such communicationcan occur via I/O interfaces of the device 712. Still yet, computersystem/server 702 can communicate with one or more networks such as alocal area network (LAN), a general wide area network (WAN), and/or apublic network (e.g., the Internet) via a network adapter. As depicted,device 712 communicates with the other components of computersystem/server 702 via a bus. It should be understood that although notshown, other hardware and/or software components could be used inconjunction with computer system/server 702. Examples, include, but arenot limited to: microcode, device drivers, redundant processing units,external disk drive arrays, RAID systems, tape drives, and data archivalstorage systems, etc.

Although an exemplary embodiment of at least one of a system, method,and non-transitory computer readable medium has been illustrated in theaccompanied drawings and described in the foregoing detaileddescription, it will be understood that the application is not limitedto the embodiments disclosed, but is capable of numerous rearrangements,modifications, and substitutions as set forth and defined by thefollowing claims. For example, the capabilities of the system of thevarious figures can be performed by one or more of the modules orcomponents described herein or in a distributed architecture and mayinclude a transmitter, receiver or pair of both. For example, all orpart of the functionality performed by the individual modules, may beperformed by one or more of these modules. Further, the functionalitydescribed herein may be performed at various times and in relation tovarious events, internal or external to the modules or components. Also,the information sent between various modules can be sent between themodules via at least one of: a data network, the Internet, a voicenetwork, an Internet Protocol network, a wireless device, a wired deviceand/or via plurality of protocols. Also, the messages sent or receivedby any of the modules may be sent or received directly and/or via one ormore of the other modules.

One skilled in the art will appreciate that a “system” could be embodiedas a personal computer, a server, a console, a personal digitalassistant (PDA), a cell phone, a tablet computing device, a smartphoneor any other suitable computing device, or combination of devices.Presenting the above-described functions as being performed by a“system” is not intended to limit the scope of the present applicationin any way but is intended to provide one example of many embodiments.Indeed, methods, systems and apparatuses disclosed herein may beimplemented in localized and distributed forms consistent with computingtechnology.

It should be noted that some of the system features described in thisspecification have been presented as modules, in order to moreparticularly emphasize their implementation independence. For example, amodule may be implemented as a hardware circuit comprising custom verylarge-scale integration (VLSI) circuits or gate arrays, off-the-shelfsemiconductors such as logic chips, transistors, or other discretecomponents. A module may also be implemented in programmable hardwaredevices such as field programmable gate arrays, programmable arraylogic, programmable logic devices, graphics processing units, or thelike.

A module may also be at least partially implemented in software forexecution by various types of processors. An identified unit ofexecutable code may, for instance, comprise one or more physical orlogical blocks of computer instructions that may, for instance, beorganized as an object, procedure, or function. Nevertheless, theexecutables of an identified module need not be physically locatedtogether but may comprise disparate instructions stored in differentlocations that when joined logically together, comprise the module andachieve the stated purpose for the module. Further, modules may bestored on a computer-readable medium, which may be, for instance, a harddisk drive, flash device, random access memory (RAM), tape, or any othersuch medium used to store data.

Indeed, a module of executable code could be a single instruction, ormany instructions, and may even be distributed over several differentcode segments, among different programs, and across several memorydevices. Similarly, operational data may be identified and illustratedherein within modules and may be embodied in any suitable form andorganized within any suitable type of data structure. The operationaldata may be collected as a single data set or may be distributed overdifferent locations including over different storage devices, and mayexist, at least partially, merely as electronic signals on a system ornetwork.

It will be readily understood that the components of the application, asgenerally described and illustrated in the figures herein, may bearranged and designed in a wide variety of different configurations.Thus, the detailed description of the embodiments is not intended tolimit the scope of the application as claimed but is merelyrepresentative of selected embodiments of the application.

One having ordinary skill in the art will readily understand that theabove may be practiced with steps in a different order, and/or withhardware elements in configurations that are different than those whichare disclosed. Therefore, although the application has been describedbased upon these preferred embodiments, it would be apparent to those ofskill in the art that certain modifications, variations, and alternativeconstructions would be apparent.

While preferred embodiments of the present application have beendescribed, it is to be understood that the embodiments described areillustrative only and the scope of the application is to be definedsolely by the appended claims when considered with a full range ofequivalents and modifications (e.g., protocols, hardware devices,software platforms etc.) thereto.

What is claimed is:
 1. A method, comprising: maneuvering, by a MobileEnergy Storage Unit (MESU), to a transport that is: identified asavailable to transfer energy to the MESU based on the transport beingstationary for a threshold amount of time, not currently being charged,at a distance between the transport and the MESU, and within a timeframefor the MESU to reach the transport; and retrieving, by the mobileenergy storage unit, a minimum amount of energy from the transport. 2.The method of claim 1, comprising: maneuvering, by the MESU, to anothertransport that previously did not have the minimum amount of energy butcurrently has the minimum amount of energy.
 3. The method of claim 1,comprising: determining, by the MESU, one or more of a current motion ofthe transport and an amount of time since the transport has been inmotion.
 4. The method of claim 1, comprising: determining, by the MESU,the transport is not currently being charged when the transport islocated in an area not proximate to a charging station.
 5. The method ofclaim 1, wherein the minimum amount of energy is based on a decreasingusage related to an amount of time remaining in a period of time, andwherein the period of time is related to a time of limited probableusage of the transport and an expiration of time remaining in the periodof time.
 6. The method of claim 1, comprising: stopping, by the MESU,the retrieving when one or more the following events occur on thetransport: an opening of a door of the transport; a utilization of aseat belt of the transport; and an interaction with an ignition of thetransport.
 7. The method of claim 1, comprising: stopping, by the MESU,the retrieving when one or more of audio and gesture from an authorizeduser of the transport indicates that the retrieving should stop.
 8. AMobile Energy Storage Unit (MESU), comprising: a processor configuredto: maneuver the MESU to a transport that is: identified as available totransfer energy to the MESU based on the transport being stationary fora threshold amount of time, not currently in a state of charge, at adistance between the transport and the MESU, and within a timeframe forthe MESU to reach the transport; and retrieve a minimum amount of energyfrom the transport.
 9. The MESU of claim 8, wherein the processor isconfigured to: maneuver to another transport that previously did nothave the minimum amount of energy but currently has the minimum amountof energy.
 10. The MESU of claim 8, wherein the processor is configuredto: determine one or more of a current motion of the transport and anamount of time since the transport has been in motion.
 11. The MESU ofclaim 8, wherein the processor is configured to: determine that thetransport is not currently in a state of charge when the transport islocated in an area not proximate to a charging station.
 12. The MESU ofclaim 8, wherein the minimum amount of energy is based on a decrease ofusage related to an amount of time that remains in a period of time, andwherein the period of time is related to a time of limited probableusage of the transport and an expiration of time that remains in theperiod of time.
 13. The MESU of claim 8, wherein the processor isconfigured to: stop the retrieve when one or more the events occur onthe transport: an initiation of an open door of the transport; autilization of a seat belt of the transport; and an interaction with anignition of the transport.
 14. The MESU of claim 8, wherein theprocessor is configured to: stop the retrieve when one or more of audioand gesture from an authorized user of the transport indicates that theretrieve should stop.
 15. A non-transitory computer readable mediumcomprising one or more instructions that when executed by a processor ofa Mobile Energy Storage Unit (MESU) cause the MESU to perform:maneuvering, by a Mobile Energy Storage Unit (MESU), to a transport thatis: identified as available to transfer energy to the MESU based on thetransport being stationary for a threshold amount of time, not currentlybeing charged, that is at a distance between the transport and the MESU,and that is within a timeframe for the MESU to reach the transport; andretrieving, by the mobile energy storage unit, a minimum amount ofenergy from the transport.
 16. The non-transitory computer readablemedium of claim 15, wherein the one or more instructions further causethe MESU to perform: maneuvering to another transport that previouslydid not have the minimum amount of energy but currently has the minimumamount of energy.
 17. The non-transitory computer readable medium ofclaim 15, wherein the one or more instructions further cause the MESU toperform: determining one or more of a current motion of the transportand an amount of time since the transport has been in motion.
 18. Thenon-transitory computer readable medium of claim 15, wherein the one ormore instructions further cause the MESU to perform: determining thetransport is not currently being charged when the transport is locatedin an area not proximate to a charging station.
 19. The non-transitorycomputer readable medium of claim 15, wherein the minimum amount ofenergy is based on a decreasing usage related to an amount of timeremaining in a period of time, and wherein the period of time is relatedto a time of limited probable usage of the transport and an expirationof time remaining in the period of time.
 20. The non-transitory computerreadable medium of claim 15, wherein the one or more instructionsfurther cause the MESU to perform: stopping the retrieving when one ormore the following event occurs on the transport: an opening of a doorof the transport; a utilization of a seat belt of the transport; and aninteraction with an ignition of the transport.